Number/theoretic solutions to intercept time problems

نویسندگان

  • I. Vaughan L. Clarkson
  • Jane E. Perkins
  • Iven M. Y. Mareels
چکیده

| We consider a number of problems concerning the overlaps or coincidences of two periodic pulse trains. We show that the rst intercept time of two pulse trains started in phase is a homogeneous Diophantine approximation problem which can be solved using the convergents of the simple continued fraction (s.c.f.) expansion of the ratio of their pulse repetition intervals (PRIs). We nd that the intercept time for arbitrary starting phases is an inhomo-geneous Diophantine approximation problem which can be solved in a similar manner. We give a recurrence equation to determine the times at which subsequent coincidences occur. We then demonstrate how the convergents of the s.c.f. expansion can be used to determine the probability of intercept of the two pulse trains after a speciied time when one or both of the initial phases are random. Finally, we discuss how the probability of intercept varies as a function of the PRIs and its dependence on the Farey points.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Novel Application of Number Theoretic Methods to

Two techniques which are important in the passive detection of radars are the time-diierence of arrival (TDOA) histogram and time of arrival (TOA) folding. The methods are designed to highlight and resolve periodicities in the radar pulse time of arrival data so that pulses from diierent radars can be separated. However, both methods exhibit interference eeects which resemble \noise oors." We s...

متن کامل

A New heuristic approach for large size Zero-One Multi Knapsack Problem using intercept matrix

This paper presents a heuristic to solve large size 0-1 Multi constrained Knapsack problem (01MKP) which is NP-hard. Many researchers are used heuristic operator to identify the redundant constraints of Linear Programming Problem before applying the regular procedure to solve it. We use the intercept matrix to identify the zero valued variables of 01MKP which is known as redundant variables. In...

متن کامل

A new heuristic approach for the large-scale Generalized assignment problem

This paper presents a heuristic approach to solve the Generalized Assignment Problem (GAP) which is NP-hard. It is worth mentioning that many researches used to develop algorithms for identifying the redundant constraints and variables in linear programming model. Some of the algorithms are presented using intercept matrix of the constraints to identify redundant constraints and variables prior...

متن کامل

Decision-Theoretic Approach for Controlling and Coordinating multiple Active Cameras in Surveillance

This research presents a novel decision-theoretic approach to control and coordinate multiple active (pan-tilt-zoom) cameras to achieve high-quality surveillance. The decision-theoretic approaches provide robust mathematical frameworks that can model the interactions between the active camera network and the surveillance environment. It offers advantage of planning optimal control decisions for...

متن کامل

at the Physical Layer

1053-5888/13/$31.00©2013IEEE ireless comm u n i c a t i o n s systems are particularly vulnerable to security attacks because of the inherent openness of the transmission medium. In this article, we focus on guaranteeing confidentiality against eavesdropping attacks where an unauthorized entity aims to intercept an ongoing wireless communication, and we provide a comprehensive summary of recent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1996